Satisfiability in Strategy Logic Can Be Easier than Model Checking
نویسندگان
چکیده
منابع مشابه
Model Checking Almost All Paths Can Be Less Expensive Than Checking All Paths
We compare the complexities of the following two model checking problems: checking whether a linear-time formula is satis ed by all paths (which we call universal model checking) and checking whether a formula is satis ed by almost all paths (which we call fair model checking here). For many interesting classes of linear-time formulas, both problems have the same complexity: for instance, they ...
متن کاملModel Checking and Satisfiability for Sabotage Modal Logic
We consider the sabotage modal logic SML which was suggested by van Benthem. SML is the modal logic equipped with a ‘transition-deleting’ modality and hence a modal logic over changing models. It was shown that the problem of uniform model checking for this logic is PSPACE-complete. In this paper we show that, on the other hand, the formula complexity and the program complexity are linear, resp...
متن کاملSymbolic Model Checking Epistemic Strategy Logic
This paper presents a symbolic BDD-based model checking algorithm for an epistemic strategy logic with observational semantics. The logic has been shown to be more expressive than several variants of ATEL and therefore the algorithm can also be used for ATEL model checking. We implement the algorithm in a model checker and apply it to an application on train control system. The performance of t...
متن کاملBreaking RSA May Be Easier Than Factoring
We provide evidence that breaking low-exponent rsa cannot be equivalent to factoring integers. We show that an algebraic reduction from factoring to breaking low-exponent rsa can be converted into an e cient factoring algorithm. Thus, in e ect an oracle for breaking rsa does not help in factoring integers. Our result suggests an explanation for the lack of progress in proving that breaking rsa ...
متن کاملEvaluation May Be Easier than Generation
Kearns et al. [18] de ned two notions for learning a distribution D. The rst is with generator, where the learner presents a generator that outputs a distribution identical or close to D. The other is with an evaluator, where the learner presents a procedure that on input x evaluates correctly (or approximates) the probability that x is generated by D. They showed an example where e cient learn...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the AAAI Conference on Artificial Intelligence
سال: 2019
ISSN: 2374-3468,2159-5399
DOI: 10.1609/aaai.v33i01.33012638